Mω considered as a programming language
نویسندگان
چکیده
منابع مشابه
Turing Completeness Considered Harmful: Component Programming with a Simple Language
Languages are increasingly being used to reuse computations as components as well as to express these computations in the first place. However, the expression of computations and component assembly have opposing language requirements: the former requires flexible Turing-complete constructs that can express many interactions while the latter benefits from constructs that instead hide interaction...
متن کاملConsidered Both as a Paradigmatic Language and as a Meta-language
Intuitionistic Linear Logic (ILL) is a resource-conscious logic. The Curry-Howard Isomorphism (CHI) applied to ILL, generates typed functional-like languages that have primitive constants by means of which the amount of resources (terms), used during the computation, is explicit. ! is an untyped functional-like language inspired from a typed language joined at ILL by CHI. We want to use the res...
متن کاملJava as a Functional Programming Language
We introduce a direct encoding of the typed λ-calculus into Java: for any Java types A, B we introduce the type A→ B together with function application and λ-abstraction. The latter makes use of anonymous inner classes. We show that λ-terms are evaluated by call-by-value. We then look at how to model domain equations in Java and as an example consider the untyped lambda calculus. Then we invest...
متن کاملStandard ML as a Meta-Programming Language
Meta-programming languages, or program generators, are languages whose programs produce programs in other languages. We show how Standard ML makes an excellent meta-programming language, by adding appropriate program-valued | by which we mean string-valued | operations for each domain. We do so by giving four examples of meta-programming languages: a top-down parser generator; a \geometric regi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1999
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(99)80002-5